Second-order cone optimization of the gradostat

نویسندگان

چکیده

The gradostat consists of multiple chemostats interconnected by mass flows and diffusion. It has been used to model biochemical systems such as wastewater treatment networks microbial activity in soil. In this paper we maximize the production biogas a at steady state. physical decision variables are water, substrate, biomass entering each tank through interconnecting pipes. Our main technical focus is nonconvex constraint describing growth. We formulate relaxation prove that it exact when outflow connected, its system matrix irreducible, growth rate satisfies simple condition. second-order cone representations for Monod Contois rates. extend state models case time periods replacing derivatives with numerical approximations instead setting them zero. resulting optimizations programs, which can be solved large scales using standard industrial software.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Second Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems

A disadvantage of the SDP (semidefinite programming) relaxation method for quadratic and/or combinatorial optimization problems lies in its expensive computational cost. This paper proposes a SOCP (second-order-cone programming) relaxation method, which strengthens the lift-and-project LP (linear programming) relaxation method by adding convex quadratic valid inequalities for the positive semid...

متن کامل

Second-order cone programming

Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...

متن کامل

Error bound optimization using second order cone programming

In safety of life applications using satellite navigation, the Protection Level (PL) equation translates what is known about the pseudorange errors into a hard bound on the positioning error (the Protection Level). The current PL equations for Satellite Based Augmentation Systems are based on Gaussian statistics: all errors are characterized by a zero mean Gaussian distribution which is an uppe...

متن کامل

Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization

We investigate the derivation of disjunctive conic cuts for mixed integer second order cone optimization (MISOCO). These conic cuts characterize the convex hull of the intersection of a disjunctive set and the feasible set of a MISOCO problem. We present a full characterization of these inequalities when the disjunctive set considered is defined by parallel hyperplanes.

متن کامل

Sparse Second Order Cone Programming Formulations for Convex Optimization Problems

Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Chemical Engineering

سال: 2021

ISSN: ['1873-4375', '0098-1354']

DOI: https://doi.org/10.1016/j.compchemeng.2021.107347